A criterion for the applicability of Zeilberger's algorithm to rational functions

نویسندگان

  • Sergei A. Abramov
  • Ha Q. Le
چکیده

We consider the applicability (or terminating condition) of the well-known Zeilberger’s algorithm and give the complete solution to this problem for the case where the original hypergeometric term F(n; k) is a rational function. We specify a class of identities ∑n k=0 F(n; k) = 0; F(n; k)∈C(n; k), that cannot be proven by Zeilberger’s algorithm. Additionally, we give examples showing that the set of hypergeometric terms on which Zeilberger’s algorithm terminates is a proper subset of the set of all hypergeometric terms, but a super-set of the set of proper terms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applicability of the q-analogue of Zeilberger's algorithm

The applicability or terminating condition for the ordinary case of Zeilberger’s algorithm was recently obtained by Abramov. For the qanalogue, the question of whether a bivariate q-hypergeometric term has a qZ-pair remains open. Le has found a solution to this problem when the given bivariate q-hypergeometric term is a rational function in certain powers of q. We solve the problem for the gene...

متن کامل

An Introduction to a New Criterion Proposed for Stopping GA Optimization Process of a Laminated Composite Plate

Several traditional stopping criteria in Genetic Algorithms (GAs) are applied to the optimization process of a typical laminated composite plate. The results show that neither of the criteria of the type of statistical parameters, nor those of the kinds of theoretical models performs satisfactorily in determining the interruption point for the GA process. Here, considering the configuration of ...

متن کامل

The method of radial basis functions for the solution of nonlinear Fredholm integral equations system.

In this paper, An effective and simple numerical method is proposed for solving systems of integral equations using radial basis functions (RBFs). We present an algorithm based on interpolation by radial basis functions including multiquadratics (MQs), using Legendre-Gauss-Lobatto nodes and weights. Also a theorem is proved for convergence of the algorithm. Some numerical examples are presented...

متن کامل

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

Application of PROMETHEE method for green supplier selection: a comparative result based on preference functions

The PROMETHEE is a significant method for evaluating alternatives with respect to criteria in multi-criteria decision-making problems. It is characterized by many types of preference functions that are used for assigning the differences between alternatives in judgements. This paper proposes a preference of green suppliers using the PROMETHEE under the usual criterion preference functions. Comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 259  شماره 

صفحات  -

تاریخ انتشار 2002